package com.shiguiwu.springmybatis.leetcode;

import com.shiguiwu.springmybatis.algorithm.linkedlist.SingleLinkedList;

/**
 * @description: 环形队列
 * @author: stone
 * @date: Created by 2022/8/15 22:05
 * @version: 1.0.0
 * @pakeage: com.shiguiwu.springmybatis.leetcode
 */
public class CircularDeque {

    private MyNode header;

    private int size;

    private int front;

    private int last;

    public CircularDeque(int k) {
        header = new MyNode(-1);
        MyNode next = header;
        while (next.next != null) {
            next = next.next;
        }
        next.next = new MyNode(k);
        size = k;
        front = -1;
        last = 0;
    }

    public boolean insertFront(int value) {

        return false;
    }

    public boolean insertLast(int value) {
        return false;
    }

    public boolean deleteFront() {
        return false;
    }

    public boolean deleteLast() {
        return false;
    }

    public int getFront() {
        return 0;
    }

    public int getRear() {
        return 0;
    }

    public boolean isEmpty() {
        return size == 0;
    }

    public boolean isFull() {
        return size ==0;
    }


    public static class MyNode {

        private int data;

        private MyNode next;

        public MyNode(int data) {
            this.data = data;
        }
    }

}
